
|
|

|
Simon S. Lam Wins 2004 ACM SIGCOMM Award for Networking Advancements
|

|
SIGCOMM, ACM's Special Interest
Group on Data Communications, has awarded its highest honor to Simon S. Lam of
the University of Texas at Austin for his seminal contributions to computer
networking. Lam was recognized by the 2004 ACM SIGCOMM Award for his vision,
breadth, and rigor in contributing to secure network communication.
Through his research, teaching, and service, Lam provided forward-looking
foundations for computer networking research. His work in 1993 on the design
and construction of the first socket-like abstraction for secure network
programming preceded by two years the initial Internet draft on the secure
socket layer (SSL) widely used today for e-commerce between browsers and
servers. His research extended to the analysis of network and multiaccess
protocols and queueing networks, and to the design of mechanisms for quality of
service.
Beginning with his PhD thesis, Lam provided insights on sharing broadcast
channels by random access. His work led to effective algorithms for adaptive
control and served as a foundation for subsequent research on random access
protocols.
While at IBM Research, Lam made fundamental contributions to the theory of
queueing networks. His efforts were motivated by applications to the
performance analysis of packet switching networks, including assessment of
network congestion control and window-based flow control. During the 1980s,
Lam played a major role in the design, specification, verification, and
conversion of network protocols. His work inspired a large body of subsequent
research on the topic.
Lam made substantial contributions to network and end system support for
quality of service guarantees. His formulation of an end-to-end delay
guarantee for a general class of servers unified previous work and simplified
subsequent analysis of quality of service disciplines.
Lam is an ACM Fellow and an IEEE Fellow. He is a winner of the 2004 W. Wallace
McDowell Award, the 2001 William R. Bennett Prize, and the 1975 Leonard G.
Abraham Prize. Over the course of 25 years in computer networking and data
communications, Lam contributed to the technical organization of the community
in many ways, serving as Editor in Chief of IEEE/ACM Transactions on Networking,
the field's premier journal. He has supervised numerous doctoral students, many
of whom are themselves ongoing contributors to computer networking.
|
|
|

|
|

|

|
STORIES
|

|
|

|

|
ANNOUNCEMENTS
|

|
|

|
|

|

|
How They Could Steal the Election This Time
|
The Nation,
July 29, 2004
|

|

|
Peter Neumann cites ways computerized voting can be tampered with.
|
|

|
Diverse Sciences Propel Bioinformatics
|
eWeek,
August 20, 2004
|

|

|
ACM Kanellakis Award winner Gene Myers calls for more cross-disciplinary conferences and researchers.
|
|

|
By the Book
|
InformationWeek,
August 23, 2004
|

|

|
Former ACM Pres Stuart Zweben says students are getting cold feet about entering CS field.
|
|

|
Is Encryption Doomed?
|
Technology Review,
September 1, 2004
|

|

|
RSA co-developer and 2002 Turing Award co-recipient Len Adelman on one of encryption's thorniest problems.
|
|

|
Geeks Code for the Gold
|
Wired News,
September 14, 2004
|

|

|
ACM a sponsor of high-school programming competition in Athens.
|
|

|
CMU Project Envisions Computers Even the Poorest Third World Farmer Could Use
|
Pittsburgh Post-Gazette,
September 20, 2004
|

|

|
Turing Award winner Raj Reddy sees combination PC, TV, video recorder and telephone device helping the poor to communicate.
|
|

|
World's Top Collegiate Programmers Go Head-to-Head at IBM-Sponsored "Battle of the Brains"
|
Market Wire,
September 23, 2004
|

|

|
This year's ICPC competitors to use IBM POWER-based parallel supercomputers.
|
|

|
Paperless E-Voting Gets Thumbs Down From ACM
|
IDG News Service,
September 28, 2004
|

|
SIGGRAPH 2004 in the News
|
|
|
|

|
|

|